Connection matrices for ultradiscrete linear problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connection Matrices for Ultradiscrete Linear Problems

We present theory outlining the linear problems associated with ultradiscrete equation. The appropriate domain for such problems being the max-plus semiring. Our main result being that despite the restrictive nature of this semiring, it is still possible to define a theory of monodromy analogous to that of Birkhoff and his school for systems of linear difference equations over the max-plus semi...

متن کامل

Canonical Matrices for Linear Matrix Problems

We consider a large class of matrix problems, which includes the problem of classifying arbitrary systems of linear mappings. For every matrix problem from this class, we construct Belitskĭı’s algorithm for reducing a matrix to a canonical form, which is the generalization of the Jordan normal form, and study the set Cmn of indecomposable canonical m× n matrices. Considering Cmn as a subset in ...

متن کامل

Connection matrices

Suppose you want to evaluate a graph parameter on a graph G. There is a cut of size k in a graph, and while you know everything about one side of the cut, you have to pay for information about the other side. How much information do you need about the other side? To avoid the trivial solution “just tell me the value of the parameter, if my side looks like this”, let us assume that the informati...

متن کامل

P D - Matrices and Linear Complementarity Problems

Motivated by the definition of P†-matrix ([9]), another generalization of a P -matrix for square singular matrices called PD-matrix is proposed first. Then the uniqueness of solution of Linear Complementarity Problems for square singular matrices is proved using PD-matrices. Finally some results which are true for P -matrices are extended to PD-matrices.

متن کامل

Enclosing Solutions of Linear Complementarity Problems for H-Matrices

The paper establishes a computational encIosure of the solution of the linear complementarity problem (q, M), where M is assumed to be an H-matrix with a positive main diagonal. A dass of problems with interval data, which can arise in approximating the solutions of free boundary problems, is also treated successfully.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical

سال: 2007

ISSN: 1751-8113,1751-8121

DOI: 10.1088/1751-8113/40/42/s22